New State Dependent Multicast Routing for Single Rate Loss Networks
نویسندگان
چکیده
In this paper we investigate the dynamic multi cast routing problem for single rate loss networks and brie y discuss the dynamic multicast rout ing algorithm called Least Load Multicast Rout ing LLMR We propose a new multicast routing algorithm called Maximum Mean Number of New Calls Accepted Before Blocking Multicast Routing MCBMR which can more accurately re ect the current and future loading of a network Simu lation results show that this algorithm compared with LLMR not only has a smaller network rev enue loss but also results in smaller call blocking probabilities for all classes of tra c
منابع مشابه
A New Method based on Intelligent Water Drops for Multicast Routing in Wireless Mesh Networks
In recent years a new type of wireless networks named wireless mesh networks has drawn the attention of researchers. In order to increase the capacity of mesh network, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi channel wireless mesh networks. Therefore, the main challenge of these networks is how to properly assign the channels to the radios. O...
متن کاملDynamic Multicast Routing in Circuit-switched Networks
In this paper, we investigate the well-known state dependent multicast routing algorithm called Least Load Multicast Routing (LLMR), for single rate loss networks. The algorithm is based on the Least Load Routing (LLR) concept and the approach is to select the least load links for establishing connections. We propose a modiied version, called Ag-gregated Least Load Multicast Routing (ALLMR), wh...
متن کاملState Dependent Multicast Routing for Single Rate Loss Networks
In this paper we investigate a state dependent multicast routing algorithm called Least Load Multicast Routing LLMR for single rate loss networks The algorithm is based on Least Load Routing LLR concept and the approach is to se lect the least load links for establishing connec tions To facilitate tractable analysis the net works considered are assumed symmetrical and fully connected In additio...
متن کاملMulticast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملA Survey on Multicast Routing Approaches in Wireless Mesh Networks
Wireless mesh networks (WMNs) which mediates the broadband Internet access, have been recently received many attentions by the researchers. In order to increase capacity in these networks, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi-channel WMNs (MRMC WMNs). Therefore, a vital challenge that poses in MRMC WMNs is how to properly assign channels ...
متن کامل